Conjugate-direction minimization: an improved method for the refinement of macromolecules.
نویسنده
چکیده
A novel method of function minimization that combines the power of the diagonal approximation to the normal matrix with conjugate directions is described. This method approaches closer to the local minimum than the methods that are commonly used in macromolecular refinement. The weakness of the current methods are analyzed to explain the advantage of the conjugate-direction method.
منابع مشابه
A new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations
In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...
متن کاملOptimum Shape Design of a Radiant Oven by the Conjugate Gradient Method and a Grid Regularization Approach
This study presents an optimization problem for shape design of a 2-D radiant enclosure with transparent medium and gray-diffuse surfaces. The aim of the design problem is to find the optimum geometry of a radiant enclosure from the knowledge of temperature and heat flux over some parts of boundary surface, namely the design surface. The solution of radiative heat transfer is based on the net r...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملAn increasing-angle property of the conjugate gradient method and the implementation of large-scale minimization algorithms with line searches
The search direction in unconstrained minimization algorithms for large scale problems is usually computed as an iterate of the (precondi-tioned) conjugate gradient method applied to the minimization of a local quadratic model. In line-search procedures this direction is required to satisfy an angle condition, that says that the angle between the negative gradient at the current point and the d...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta crystallographica. Section A, Foundations of crystallography
دوره 48 ( Pt 6) شماره
صفحات -
تاریخ انتشار 1992